Notes on Complexity Theory Last updated : November , 2011 Lecture 22
نویسنده
چکیده
We show here a probabilistically checkable proof for NP in which the verifier reads only a constant number of bits from the proof (and uses only polynomially many random bits). In addition to being of independent interest, this result is used as a key step in the proof of the PCP theorem itself. To show the desired result, we will work with the NP-complete language of satisfiable quadratic equations. Instances of this problem consist of a system of m quadratic equations n ∑
منابع مشابه
Notes on Complexity Theory Last updated : November , 2011 Lecture 25
Randomization provides unconditional benefits in many settings; examples include cryptography (where random keys are used to provide protection against an adversary) and distributed computing (where randomness can be used as a means to break symmetry between parties). Randomness also appears to help in algorithm design. But is it possible that, from a complexity-theoretic perspective, randomnes...
متن کاملNotes on Complexity Theory Last updated : September 14 , 2011 Lecture 5
We know that there existNP-complete languages. Assuming P 6= NP, any NP-complete language lies in NP \ P. Are there languages that are neither in P nor NP-complete? Ladner’s theorem tells us that there are. As some intuition for Ladner’s theorem, take some language L ∈ NP \ P. Using padding, we will make L “easy enough” so that it can’t be NP-complete, while keeping it “hard enough” so it is no...
متن کاملNotes on Complexity Theory Last updated : November , 2011 Lecture 21
Work on interactive proof systems motivates further exploration of non-interactive proof systems (e.g., the class NP). One specific question is: how many bits of the proof does the verifier need to read? Note that in the usual certificate-based definition of NP, the deterministic “verifier” reads the entire certificate, and correctness and soundness hold with probability 1. If we allow the veri...
متن کاملNotes on Complexity Theory Last updated : December , 2011 Lecture 28
Recall that one motivation for studying non-uniform computation is the hope that it might be easier to prove lower bounds in that setting. (This is somewhat paradoxical, as non-uniform algorithms are more powerful than uniform algorithms; nevertheless, since circuits are more “combinatorial” in nature than uniform algorithms, there may still be justification for such hope.) The ultimate goal he...
متن کاملCountable Borel Equivalence Relations Simon Thomas and Scott Schneider
Introduction. These notes are based upon a day-long lecture workshop presented by Simon Thomas at the University of Ohio at Athens on November 17, 2007. The workshop served as an intensive introduction to the emerging theory of countable Borel equivalence relations. These notes are an updated and slightly expanded version of an earlier draft which was compiled from the lecture slides by Scott S...
متن کامل